From extremal trajectories to consistency in P-time Event Graphs Technical report
نویسنده
چکیده
Using (max, +) algebra, this paper presents a modeling and an analysis method of P-time Event Graphs whose behaviors are defined by lower and upper bound constraints. On the hypothesis of liveness of Event Graphs, consistency is defined by the existence of a temporal trajectory. The extremal trajectories starting from an initial interval are deduced by two dual polynomial algorithms based on a particular series of matrices. The analysis of the circuits introduces conditions of consistency.
منابع مشابه
The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملCycle time of p-time event graphs
The dater equalities constitutes an appropriate tool which allows a linear description of Timed Event Graphs in the field of (max, +) algebra. This paper proposes an equivalent model in the usual algebra which can describe Timed and P-time Event Graphs. Considering 1-periodic behavior, the application of a variant of Farkas’ lemma allows the determination of upper and lower bounds of the produc...
متن کاملExtremal Trajectories for Bounded Velocity Differential Drive Robots
This paper applies Pontryagin’s Maximum Principle to the time optimal control of differential drive mobile robots with velocity bounds. The Maximum Principle gives necessary conditions for time optimality. Extremal trajectories are those which satisfy these conditions, and are thus a superset of the time optimal trajectories. This paper derives a compact geometrical structure for extremal traje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009